Axiomatizing Permutation Equivalence

Con ict - free Stable Transition and

We describe an event-style (or poset) semantics for connict-free rewrite systems, such as the-calculus, and other stable transition systems with a residual relation. Our interpretation is based on considering redex-families as events. It treats permutation-equivalent reductions as representing the same concurrent computation. Due to erasure of redexes, Event Structures are inadequate for such a...

Axiomatizing Operational Equivalence in the Presence of Side Effects

Combining Equational Theories Sharing Non-Collapse-Free Constructors

In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension broadens the scope of the combination procedure considerably, for example in the direction of equational theories axiomatizing the equivalence of modal formulae.

Axiomatizing Political Philosophy of Distributive Justice: Equivalence of No-envy and Egalitarian-equivalence with Welfare-egalitarianism∗†

We analyze the political philosophy question of what kind of welfare differentials are allowed if we respect private ownership rights over self and public ownership of the external world. We consider cases where agents have equal rights over the publicly owned external world resources but are individually responsible for their preferences. We discuss that these ownership rights are naturally re...

Ordering sequences by permutation transducers

To extend a natural concept of equivalence of sequences to two-sided infinite sequences, the notion of permutation transducer is introduced. Requiring the underlying automaton to be deterministic in two directions, it provides the means to rewrite bi-infinite sequences. The first steps in studying the ensuing hierarchy of equivalence classes of bi-infinite sequences are taken, by describing the...